Extremal Trinomials over Quadratic Finite Fields

نویسنده

  • Sean W. Owen
چکیده

In the process of pursuing a finite field analogue of Descartes’ Rule, Bi, Cheng, and Rojas (2014) proved an upper bound of 2 √ q − 1 on the number of roots of a trinomial c1 + c2x a2 + c3x a3 ∈ Fq [x], conditional on the exponents satisfying δ = gcd(a2, a3, q − 1) = 1, and Cheng, Gao, Rojas, and Wan (2015) showed that this bound is near-optimal for many cases. Our project set out to refine these results by finding new bounds and extremal examples for cases not yet explored. We construct a class of extremal examples having √ q roots on fields with q an even power of a prime, by using linear maps with large null spaces over Fq. Additionally, we present a new upper bound of 1+ √ 4q−7 2 for all q under the same constraints as before, using an alternate method involving reduced trinomials with disjoint root sets, which establishes the examples as maximal. Our methods offer several possible generalizations to other cases. 1 Background and Objectives Sparse polynomials, which have a fixed number of terms, regardless of their degree, often have much lower maximum numbers of roots than general polynomials over the same field. For example, over the real numbers, Descartes’s Rule states that a polynomial with t nonzero roots must have less than 2t real roots. This bound is sharp; for example, the polynomial x(x−1)(x−2) · · · (x−(t−1)) has t terms and 2t− 1 roots [2]. Our current work is part of an effort to formulate an analogous rule for finite fields Fq. We define a univariate t-nomial as f(x) = c1 + c2x2 + · · · + ctxt with a2 < · · · < at < q − 1, and for such f we define δ = gcd(a2, . . . , at, q − 1). Bi, Cheng and Rojas (2014) recently showed that the nonzero roots of t-nomials over Fq display a peculiar multiplicative structure: they can be partitioned into cosets of two subgroups of Fq , whose number and size are predictable based on q, t, and δ. Theorem 1.1 (Thm. 1.1 in [1]). The nonzero roots of a univariate t-nomial as defined above are the union of at most 2 ( q−1 δ ) t−2 t−1 cosets of two subgroups S1 ⊆ S2, with |S1| = δ and |S2| ≥ δ ( q−1 δ ) 1 t−1 .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields

This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...

متن کامل

New Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic

In this paper, a class of permutation trinomials of Niho type over finite fields with even characteristic is further investigated. New permutation trinomials from Niho exponents are obtained from linear fractional polynomials over finite fields, and it is shown that the presented results are the generalizations of some earlier works.

متن کامل

New Permutation Trinomials Constructed from Fractional Polynomials

Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six new classes of permutation trinomials over finite fields of even characteristic are constructed from six fractional polynomials. Further, three classes of p...

متن کامل

New extremal binary self-dual codes from F4+uF4-lifts of quadratic circulant codes over F4

In this work, quadratic double and quadratic bordered double circulant constructions are applied to F4 + uF4 as well as F4, as a result of which extremal binary self-dual codes of length 56 and 64 are obtained. The binary extension theorems as well as the ring extension version are used to obtain 7 extremal self-dual binary codes of length 58, 24 extremal self-dual binary codes of length 66 and...

متن کامل

Several Classes of Permutation Trinomials over $\mathbb F_{5^n}$ From Niho Exponents

The construction of permutation trinomials over finite fields attracts people’s interest recently due to their simple form and some additional properties. Motivated by some results on the construction of permutation trinomials with Niho exponents, by constructing some new fractional polynomials that permute the set of the (q + 1)-th roots of unity in Fq2 , we present several classes of permutat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015